Optimized Proposed Algorithm for Graph Traversal
نویسندگان
چکیده
منابع مشابه
Graph Representations and Traversal
A graph G = (V,E), where V is the set of vertices, and E is the set of edges. An edge e ∈ E is an unordered pair (u,v) in undirected graphs, where u,v∈V . In directed graphs, an edge e is an ordered pair. A path from a vertex u to a vertex v is a sequence of vertices (w0,w1, ...wk), where u = w0, v = wk and (wi−1,wi) ∈ E for all 1 ≤ i ≤ k. The path is a cycle if u = v. The length of a path in a...
متن کاملThe Graph Traversal Pattern
A graph is a structure composed of a set of vertices (i.e. nodes, dots) connected to one another by a set of edges (i.e. links, lines). The concept of a graph has been around since the late 19th century, however, only in recent decades has there been a strong resurgence in both theoretical and applied graph research in mathematics, physics, and computer science. In applied computing, since the ...
متن کاملTime-Space Tradeoffs for Undirected Graph Traversal
We prove time-space tradeoffs for traversing undirected graphs. One of these is a quadratic lower bound on a deterministic model that closely matches the recent probabilistic upper bound of Broder, Karlin, Raghavan, and Upfal. The models used are variants of Cook and Rackoff’s “Jumping Automata for Graphs”. 1 The Complexity of Graph Traversal Graph traversal is a fundamental problem in computin...
متن کاملCompetitive Algorithms for Layered Graph Traversal
A layered graph is a connected graph whose vertices are partitioned into sets L0 = {s}, L1, L2, ..., and whose edges, which have nonnegative integral weights, run between consecutive layers. Its width is max{|Li|}. In the on-line layered graph traversal problem, a searcher starts at s in a layered graph of unknown width and tries to reach a target vertex t; however, the vertices in layer i and ...
متن کاملTime-Space Tradeoffs for Undirected Graph Traversal by Graph Automata
We investigate time-space tradeoffs for traversing undirected graphs, using a variety of structured models that are all variants of Cook and Rackoff's ``Jumping Automata for Graphs.'' Our strongest tradeoff is a quadratic lower bound on the product of time and space for graph traversal. For example, achieving linear time requires linear space, implying that depth-first search is optimal. Since ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2014
ISSN: 0975-8887
DOI: 10.5120/18234-9217